A sequent calculus for limit computable mathematics
نویسندگان
چکیده
منابع مشابه
A sequent calculus for limit computable mathematics
We prove a kind of Curry-Howard isomorphism, with some set of recursive winning strategies taking the place of typed λ-terms, and some set of classical proofs taking the place of intuitionistic proofs. We introduce an implication-free fragment PA1 of ω-arithmetic, having Exchange rule for sequents dropped. Exchange rule for formulas is, instead, an admissible rule in PA1. Then we show that cut-...
متن کاملTowards Limit Computable Mathematics
The notion of Limit-Computable Mathematics (LCM) will be introduced. LCM is a fragment of classical mathematics in which the law of excluded middle is restricted to 0 2 -formulas. We can give an accountable computational interpretation to the proofs of LCM. The computational content of LCM-proofs is given by Gold's limiting recursive functions, which is the fundamental notion of learning theory...
متن کاملLimit Computable Mathematics and Interactive Computation
We are now investigating an "executable" fragment of classical mathematics for testing formal proofs to make formal proof developments less laborious. Several theories of execution of full classical proofs are known. In these theories, some kind of abstract values such as continuations, are necessary. It makes them illegible from computational point of view, although they are mathematically int...
متن کاملSequent Calculus 3.1 Cut-free Sequent Calculus
In the previous chapter we developed linear logic in the form of natural deduction , which is appropriate for many applications of linear logic. It is also highly economical, in that we only needed one basic judgment (A true) and two judgment forms (linear and unrestricted hypothetical judgments) to explain the meaning of all connectives we have encountered so far. However, it is not immediatel...
متن کاملSequent Calculus 3.1 Cut-free Sequent Calculus
In the previous chapter we developed linear logic in the form of natural deduction , which is appropriate for many applications of linear logic. It is also highly economical, in that we only needed one basic judgment (A true) and two judgment forms (linear and unrestricted hypothetical judgments) to explain the meaning of all connectives we have encountered so far. However, it is not well-suite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2008
ISSN: 0168-0072
DOI: 10.1016/j.apal.2008.01.006